|
Pocklington's algorithm is a technique for solving a congruence of the form : where ''x'' and ''a'' are integers and ''a'' is a quadratic residue. The algorithm is one of the first efficient methods to solve such a congruence. It was described by H.C. Pocklington in 1917.〔H.C. Pocklington, Proceedings of the Cambridge Philosophical Society, Volume 19, pages 57–58〕 ==The algorithm== (Note: all are taken to mean , unless indicated otherwise.) Inputs: * ''p'', an odd prime * ''a'', an integer which is a quadratic residue . Outputs: * ''x'', an integer satisfying . Note that if ''x'' is a solution, −''x'' is a solution as well and since ''p'' is odd, . So there is always a second solution when one is found. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Pocklington's algorithm」の詳細全文を読む スポンサード リンク
|